Sparse mixture models inspired by ANOVA decompositions

نویسندگان

چکیده

Inspired by the analysis of variance (ANOVA) decomposition functions, we propose a Gaussian-uniform mixture model on high-dimensional torus which relies assumption that function wish to approximate can be well explained limited variable interactions. We consider three approaches, namely wrapped Gaussians, diagonal and products von Mises distributions. The sparsity is ensured fact its summands are Gaussian-like density functions acting low-dimensional spaces uniform probability densities defined remaining directions. To learn such sparse from given samples, an objective consisting negative log-likelihood regularizer penalizes number summands. For minimizing this functional combine Expectation Maximization algorithm with proximal step takes into account. decide important, apply Kolmogorov-Smirnov test. Numerical examples demonstrate performance our approach.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Negative Mixture Models by Tensor Decompositions

This work considers the problem of estimating the parameters of negative mixture models, i.e. mixture models that possibly involve negative weights. The contributions of this paper are as follows. (i) We show that every rational probability distributions on strings, a representation which occurs naturally in spectral learning, can be computed by a negative mixture of at most two probabilistic a...

متن کامل

Tensor Decompositions and Sparse Log-linear Models.

Contingency table analysis routinely relies on log-linear models, with latent structure analysis providing a common alternative. Latent structure models lead to a reduced rank tensor factorization of the probability mass function for multivariate categorical data, while log-linear models achieve dimensionality reduction through sparsity. Little is known about the relationship between these noti...

متن کامل

Hierarchical array priors for ANOVA decompositions

ANOVA decompositions are a standard method for describing and estimating heterogeneity among the means of a response variable across levels of multiple categorical factors. In such a decomposition, the complete set of main effects and interaction terms can be viewed as a collection of vectors, matrices and arrays that share various index sets defined by the factor levels. For many types of cate...

متن کامل

Estimating mean dimensionality of ANOVA decompositions

The analysis of variance is now often applied to functions defined on the unit cube, where it serves as a tool for the exploratory analysis of functions. The mean dimension of a function, defined as a natural weighted combination of its ANOVA mean squares, provides one measure of how hard or easy the function is to integrate by quasi-Monte Carlo sampling. This paper presents some new identities...

متن کامل

Learning Sparse Mixture Models for Discriminative Classification

Recently Saul and Lee proposed a mixture model for discriminative classification of non-negative data via non-negative matrix factorization for feature extraction. In order to improve the generalization, this paper considers a sparse version of the model. The basic idea is to minimize the sum of the weights of un-normalized mixture models for posterior distributions according to regularization ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Transactions on Numerical Analysis

سال: 2021

ISSN: ['1068-9613', '1097-4067']

DOI: https://doi.org/10.1553/etna_vol55s142